Logic Programming in Tau Categories
نویسندگان
چکیده
Many features of current logic programming languages are not captured by conventional semantics. Their fundamentally non-ground character, and the uniform way in which such languages have been extended to typed domains, subject to constraints, suggest that a categorical treatment of constraint domains, of programming syntax and of semantics may be closer in spirit to what declarative programming is really about, than conventional settheoretic semantics. We generalize the notion of a (many-sorted) logic program and of a resolution proof, by defining them both over a (not necessarily free) τ -category C , a category with products enriched with a mechanism for canonically manipulating n-ary relations [8]. Computing over this domain includes computing over the Herbrand Universe, and over equationally presented constraint domains as special cases. We give a categorical treatment of the fixpoint semantics of Kowalski and van Emden, which establishes completeness in a very general setting.
منابع مشابه
Tau: A Web-Deployed Hybrid Prover for First-Order Logic with Identity and Optional Inductive Proof
We outline Tau, a practical and extensible hybrid theorem prover for first-order predicate calculus with identity. Tau is flexible and user-configurable, accepts the KIF Language, is implemented in Java, and has multiple user interfaces. Tau combines rule-based problem rewriting with Model Elimination, uses Brand’s Modification Method to implement identity, and accepts user-configurable heurist...
متن کاملTau: A Web-Deployed Hybrid Prover for First-Order Logic with Identity, with Optional Inductive Proof
We outline Tau, a practical and extensible hybrid theorem prover for first-order predicate calculus with identity. Tau is flexible and user-configurable, accepts the KIF Language, is implemented in Java, and has multiple user interfaces. Tau combines rule-based problem rewriting with Model Elimination, uses Brand’s Modification Method to implement identity, and accepts user-configurable heurist...
متن کاملThe ring of real-continuous functions on a topoframe
A topoframe, denoted by $L_{ tau}$, is a pair $(L, tau)$ consisting of a frame $L$ and a subframe $ tau $ all of whose elements are complementary elements in $L$. In this paper, we define and study the notions of a $tau $-real-continuous function on a frame $L$ and the set of real continuous functions $mathcal{R}L_tau $ as an $f$-ring. We show that $mathcal{R}L_{ tau}$ is actually a generali...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملTowards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming
Linear-time temporal logic (LTL) and functional reactive programming (FRP) are related via a Curry–Howard correspondence. Based on this observation, we develop a common categorical semantics for a subset of LTL and its corresponding flavor of FRP. We devise a class of categorical models, called fan categories, that explicitly reflect the notion of time-dependent trueness of temporal proposition...
متن کامل